Decidable metric logics

Decidable metric logics

Article history: Received 15 July 2007 Revised 8 May 2008 Available online 11 October 2008 Thecommonmetric temporal logic for continuous timewereshowntobe insufficient,when it was proved that they cannot express a modality suggested by Pnueli. Moreover no finite temporal logic can express all the natural generalizations of this modality. It followed that if we look for an optimal decidable metr...

Decidable Characterizations for Tree Logics

A Class of Decidable Information Logics

For a class of propositional information logics defined from Pawlak’s information systems, the validity problem is proved to be decidable using a significant variant of the standard filtration technique. Decidability is proved by showing that each logic has the strong finite model property and by bounding the size of the models. The logics in the scope of this paper are characterized by classes...

Decidable fragments of first-order temporal logics

In this paper, we introduce a new fragment of the first-order temporal language, called the monodic fragment, in which all formulas beginning with a temporal operator (Since or Until) have at most one free variable. We show that the satisfiability problem for monodic formulas in various linear time structures can be reduced to the satisfiability problem for a certain fragment of classical first...

Decidable Fragments of First-Order Modal Logics

The paper considers the set ML1 of rst-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using the mosaic technique, we prove a general satissability criterion for formulas in ML1 which reduces the modal satissability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragm...